Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Subgradient optimization")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 274

  • Page / 11
Export

Selection :

  • and

An Electronic Brokering Process for Truckload FreightKAP HWAN KIM; CHOI, Yong-Woon; WOO JUN CHUNG et al.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-45901-4, Vol2, 829-838Conference Paper

Spacecraft thruster control allocation problemsSERVIDIA, Pablo A; SANCHEZ PENA, Ricardo.IEEE transactions on automatic control. 2005, Vol 50, Num 2, pp 245-249, issn 0018-9286, 5 p.Article

Optimality conditions for set-valued optimization problemsGUANG YA CHEN; JAHN, J.Mathematical methods of operations research (Heidelberg). 1998, Vol 48, Num 2, pp 187-200, issn 1432-2994Article

Inexact subgradient methods with applications in stochastic programmingAU, K. T; HIGLE, J. L; SUVRAJEET SEN et al.Mathematical programming. 1994, Vol 63, Num 1, pp 65-82, issn 0025-5610Article

On interval-subgradient and no-good cutsD'AMBROSIO, Claudia; FRANGIONI, Antonio; LIBERTI, Leo et al.Operations research letters. 2010, Vol 38, Num 5, pp 341-345, issn 0167-6377, 5 p.Article

Convergence of a simple subgradient level methodGOFFIN, J.-L; KIWIEL, K. C.Mathematical programming. 1999, Vol 85, Num 1, pp 207-211, issn 0025-5610Article

A O (η) algorithm for projecting a vector on the intersection of a hyperplane and Rn+MACULAN, N; MINOUX, M; PLATEAU, G et al.RAIRO. Recherche opérationnelle. 1997, Vol 31, Num 1, pp 7-16, issn 0399-0559Article

A primal simplex specialization for the equal flow problemSHETTY, B.IIE transactions. 1990, Vol 22, Num 1, pp 24-30, issn 0740-817X, 7 p.Article

Two well-known properties of subgradient optimizationANSTREICHER, Kurt M; WOLSEY, Laurence A.Mathematical programming (Print). 2009, Vol 120, Num 1, pp 213-220, issn 0025-5610, 8 p.Article

A Lagrangian relaxation approach to large-scale flow interception problemsGZARA, Fatma; ERKUT, Erhan.European journal of operational research. 2009, Vol 198, Num 2, pp 405-411, issn 0377-2217, 7 p.Article

Subdifferentiability and Lipschitz continuity in experimental design problemsWILHELM, A.Metrika (Heidelberg). 1995, Vol 42, Num 6, pp 365-377, issn 0026-1335Article

Solving a class of network models for dynamic flow controlCAREY, M; SRINIVASAN, A.European journal of operational research. 1994, Vol 75, Num 1, pp 151-170, issn 0377-2217Article

Nonmonotone bundle-type scheme for convex nonsmooth minimizationFACCHINEI, F; LUCIDI, S.Journal of optimization theory and applications. 1993, Vol 76, Num 2, pp 241-257, issn 0022-3239Article

A two-level subgradient method for finding saddle points of convex-concave functionsKONNOV, I. V.Computational mathematics and mathematical physics. 1993, Vol 33, Num 4, pp 453-459, issn 0965-5425Article

Moreau-rockafellar theorems for nonconvex set-valued mapsSACH, P. H.Journal of optimization theory and applications. 2007, Vol 133, Num 2, pp 213-227, issn 0022-3239, 15 p.Article

Surrogate gradient algorithm for Lagrangian relaxationZHAO, X; LUH, P. B; WANG, J et al.Journal of optimization theory and applications. 1999, Vol 100, Num 3, pp 699-712, issn 0022-3239Article

A Lagrangian dual-based branch-and-bound algorithm for the generalized multi-assignment problemPARK, J. S; BYUNG HA LIM; YOUNGHO LEE et al.Management science. 1998, Vol 44, Num 12, pp S271-S282, issn 0025-1909, 2Article

Constraint aggregation principle in convex optimizationERMOLIEV, YU. M; KRYAZHIMSKII, A. V; RUSZCZYNSKI, A et al.Mathematical programming. 1997, Vol 76, Num 3, pp 353-372, issn 0025-5610Article

Discrete Gradient Method : Derivative-Free Method for Nonsmooth OptimizationBAGIROV, A. M; KARASÖZEN, B; SEZER, M et al.Journal of optimization theory and applications. 2008, Vol 137, Num 2, pp 317-334, issn 0022-3239, 18 p.Article

Lagrangean relaxation with clusters for point-feature cartographic label placement problemsMATTOS RIBEIRO, Glaydston; NOGUEIRA LORENA, Luiz Antonio.Computers & operations research. 2008, Vol 35, Num 7, pp 2129-2140, issn 0305-0548, 12 p.Conference Paper

A method of projection onto an acute cone with level control in convex minimizationCEGIELSKI, A.Mathematical programming. 1999, Vol 85, Num 3, pp 469-490, issn 0025-5610Article

Efficient solution of large scale, single-source, capacitated plant location problemsHINDI, K. S; PIENKOSZ, K.The Journal of the Operational Research Society. 1999, Vol 50, Num 3, pp 268-274, issn 0160-5682Article

Assignment with en route training of navy personnelAGHA IQBAL ALI; KENNINGTON, J. L; LIANG, T. T et al.Naval research logistics. 1993, Vol 40, Num 5, pp 581-592, issn 0894-069XArticle

Quadratic programs over the Stiefel manifoldJINYAN FAN; PUYAN NIE.Operations research letters. 2006, Vol 34, Num 2, pp 135-141, issn 0167-6377, 7 p.Article

Augmented Lagrangian function, non-quadratic growth condition and exact penalizationZHOU, Y. Y; YANG, X. Q.Operations research letters. 2006, Vol 34, Num 2, pp 127-134, issn 0167-6377, 8 p.Article

  • Page / 11